Temporal Stream Algebra
نویسندگان
چکیده
Data stream management systems (DSMS) so far focus on event queries and hardly consider combined queries to both data from event streams and from a database. However, applications like emergency management require combined data stream and database queries. Further requirements are the simultaneous use of multiple timestamps after different time lines and semantics, expressive temporal relations between multiple time-stamps and flexible negation, grouping and aggregation which can be controlled, i. e. started and stopped, by events and are not limited to fixed-size time windows. Current DSMS hardly address these requirements. This article proposes Temporal Stream Algebra (TSA) so as to meet the afore mentioned requirements. Temporal streams are a common abstraction of data streams and database relations; the operators of TSA are generalizations of the usual operators of Relational Algebra. A in-depth ’analysis of temporal relations guarantees that valid TSA expressions are non-blocking, i. e. can be evaluated incrementally. In this respect TSA differs significantly from previous algebraic approaches which use specialized operators to prevent blocking expressions on a “syntactical” level.
منابع مشابه
A Temporal Foundation for Continuous Queries over Data Streams
Despite the surge of research in continuous stream processing, there is still a semantical gap. In many cases, continuous queries are formulated in an enriched SQL-like query language without specifying the semantics of such a query precisely enough. To overcome this problem, we present a sound and precisely defined temporal operator algebra over data streams ensuring deterministic query result...
متن کاملAnalysing Temporal Relations – Beyond Windows, Frames and Predicates
This article proposes an approach to rely on the standard operators of relational algebra (including grouping and aggregation) for processing complex event without requiring window specifications. In this way the approach can process complex event queries of the kind encountered in applications such as emergency management in metro networks. This article presents Temporal Stream Algebra (TSA) w...
متن کاملAnalysing Temporal Relations –
This article proposes an approach to rely on the standard operators of relational algebra (including grouping and aggregation) for processing complex event without requiring window specifications. In this way the approach can process complex event queries of the kind encountered in applications such as emergency management in metro networks. This article presents Temporal Stream Algebra (TSA) w...
متن کاملThe Reaction Algebra: A Formal Language for Event Correlation
Event-pattern reactive programs are small programs that process an input stream of events to detect and act upon given temporal patterns. These programs are used in distributed systems to notify components when they must react. We present the reaction algebra, a declarative language to define finitestate reactions. We prove that the reaction algebra is complete in the following sense: every eve...
متن کاملContinuous Queries over Data Streams - Semantics and Implementation
Recent technological advances have pushed the emergence of a new class of data-intensive applications that require continuous processing over sequences of transient data, called data streams, in near real-time. Examples of such applications range from business activity monitoring and online analysis of sensor data to trend detection in stock ticker data. This work presents a solid and powerful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012